Fly walk

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

To walk or to fly? How birds choose among foraging modes.

We test the predictive value of the main energetic currencies used in foraging theory using starlings that choose between two foraging modes (walking versus flying). Walking is low-cost, low-yield, whereas flying is the opposite. We fixed experimentally, at 11 different values, the amount of flight required to get one food reward, and for each flight cost value, we titrated the amount of walkin...

متن کامل

Interpolating between random walk and rotor walk

We introduce a family of stochastic processes on the integers, depending on a parameter p ∈ [0, 1] and interpolating between the deterministic rotor walk (p = 0) and the simple random walk (p = 1/2). This p-rotor walk is not a Markov chain but it has a local Markov property: for each x ∈ Z the sequence of successive exits from x is a Markov chain. The main result of this paper identifies the sc...

متن کامل

Maximum walk entropy implies walk regularity

Article history: Received 2 March 2014 Accepted 18 June 2014 Available online 9 July 2014 Submitted by R. Brualdi MSC: 05C50 15A16 82C20

متن کامل

Zeno's Walk: a Random Walk with Refinements

A self-modifying random walk on Q is deened from an ordinary random walk on the integers by interpolating a new vertex into each edge as it is crossed. This process converges almost surely to a random variable which is totally singular with respect to Lebesgue measure, and which is supported on a subset of R having Hausdorr dimension less than 1. By generating function techniques we then calcul...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Methods

سال: 2013

ISSN: 1548-7091,1548-7105

DOI: 10.1038/nmeth.2545